On absorption in semigroups and n-ary semigroups
نویسندگان
چکیده
منابع مشابه
On absorption in semigroups and n-ary semigroups
The notion of absorption was developed a few years ago by Barto and Kozik and immediately found many applications, particularly in topics related to the constraint satisfaction problem. We investigate the behavior of absorption in semigroups and n-ary semigroups (that is, algebras with one n-ary associative operation). In the case of semigroups, we give a simple necessary and sufficient conditi...
متن کاملOn the n-ary algebras, semigroups and their universal
For any n-ary associative algebra we construct a Zn−1 graded algebra, which is a universal object containing the n-ary algebra as a subspace of elements of degree 1. Similar construction is carried out for semigroups. AMS Classification: 17A42, 16N34, 20N15
متن کاملA NOVEL STUDY ON FUZZY CONGRUENCES ON n-ARY SEMIGROUPS
In this paper, we introduce the concept of fuzzy congruences on n-ary semigroups and describe quotient n-ary semigroups by fuzzy congruences. Some isomorphism theorems about n-ary semigroups are established. Moreover, we discuss a special kind of n-ary semigroups. We also establish relationships between normal fuzzy ideals and fuzzy congruences. In particular, we prove that there exists a prese...
متن کاملn–ary hyperstructures constructed from binary quasi–ordered semigroups
Based on works by Davvaz, Vougiouklis and Leoreanu-Fotea in the field of n–ary hyperstructures and binary relations we present a construction of n–ary hyperstructures from binary quasi-ordered semigroups. We not only construct the hyperstructures but also study their important elements such as identities, scalar identities or zeros. We also relate the results to earlier results obtained for a s...
متن کاملGeneralization of Czogała-Drewniak Theorem for n-ary Semigroups
We investigate n-ary semigroups as a natural generalization of binary semigroups. We refer it as a pair (X ,Fn), where X is a set and an n-associative function Fn : Xn → X is defined on X . We show that if Fn is idempotent, n-associative function which is monotone in each of its variables, defined on an interval I ⊂ R and has a neutral element, then Fn is combination of the minimum and maximum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2015
ISSN: 1860-5974
DOI: 10.2168/lmcs-11(2:15)2015